Determining All Maximum Uniquely Restricted Matching in Bipartite Graphs
نویسنده
چکیده
The approach mapping from a matching of bipartite graphs to digraphs has been successfully used for forcing set problem, in this paper, it is extended to uniquely restricted matching problem. We show to determine a uniquely restricted matching in a bipartite graph is equivalent to recognition a acyclic digraph. Based on these results, it proves that determine the bipartite graphs with all maximum matching are uniquely restricted is polynomial time. This answers an open question of Levit and Mandrescu(Discrete Applied Mathematics 132(2004) 163–164).
منابع مشابه
Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids
A matchingM is uniquely restricted in a graph G if its saturated vertices induce a subgraph which has a unique perfect matching, namely M itself [M.C. Golumbic, T. Hirst, M. Lewenstein, Uniquely restricted matchings, Algorithmica 31 (2001) 139–154]. G is a König–Egerváry graph provided (G)+ (G)= |V (G)| [R.W. Deming, Independence numbers of graphs—an extension of the König–Egerváry theorem, Dis...
متن کاملUniquely Restricted Matchings in Interval Graphs
A matching M in a graph G is said to be uniquely restricted if there is no other matching in G that matches the same set of vertices as M . We describe a polynomial-time algorithm to compute a maximum cardinality uniquely restricted matching in an interval graph, thereby answering a question of Golumbic et al. (“Uniquely restricted matchings”, M. C. Golumbic, T. Hirst and M. Lewenstein, Algorit...
متن کاملUniquely Restricted Matchings and Edge Colorings
A matching in a graph is uniquely restricted if no other matching covers exactly the same set of vertices. This notion was defined by Golumbic, Hirst, and Lewenstein and studied in a number of articles. Our contribution is twofold. We provide approximation algorithms for computing a uniquely restricted matching of maximum size in some bipartite graphs. In particular, we achieve a ratio of 9/5 f...
متن کاملLocal maximum stable sets in bipartite graphs with uniquely restricted maximum matchings
A maximum stable set in a graph G is a stable set of maximum size. S is a local maximum stable set of G, and we write S ∈0(G), if S is a maximum stable set of the subgraph spanned by S ∪ N (S), where N (S) is the neighborhood of S. A matching M is uniquely restricted if its saturated vertices induce a subgraph which has a unique perfect matching, namely M itself. Nemhauser and Trotter Jr. (Math...
متن کاملBipartite graphs with uniquely restricted maximum matchings and their corresponding greedoids
A maximum stable set in a graph G is a stable set of maximum size. S is a local maximum stable set of G, and we write S ∈ Ψ(G), if S is a maximum stable set of the subgraph spanned by S∪N(S), where N(S) is the neighborhood of S. A matching M is uniquely restricted if its saturated vertices induce a subgraph which has a unique perfect matching, namely M itself. Nemhauser and Trotter Jr. [12], pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1009.5435 شماره
صفحات -
تاریخ انتشار 2010